Tracking Many Objects with Many Sensors

Keeping track of multiple objects over time is a problem that arises in many real-world domains. The problem is often complicated by noisy sensors and unpredictable dynamics. Previous work by Huang and Russell, drawing on the data association literature, provided a probabilistic analysis and a threshold-based approximation algorithm for the case of multiple objects detected by two spatially separated sensors. This paper analyses the case in which large numbers of sensors are involved. We show that the approach taken by Huang and Rus-sell, who used pairwise sensor-based appearance probabilities as the elementary probabilis-tic model, does not scale. When more than two observations are made, the objects' intrinsic properties must be estimated. These provide the necessary conditional independencies to allow a spatial decomposition of the global probability model. We also replace Huang and Russell's threshold algorithm for object iden-tiication with a polynomial-time approximation scheme based on Markov chain Monte Carlo simulation. Using sensor data from a freeway traac simulation, we show that this allows accurate estimation of long-range ori-gin/destination information even when the individual links in the sensor chain are highly unreliable .